Experiences with Enumeration of Integer Projections of Parametric Polytopes
نویسندگان
چکیده
Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enumerator of a parametric polytope) is a function of the symbolic parameters that may appear in the constraints. In an extended problem (the “integer projection” of a parametric polytope), some of the variables that appear in the constraints may be existentially quantified and then the enumerated set corresponds to the projection of the integer points in a parametric polytope. This paper shows how to reduce the enumeration of the integer projection of parametric polytopes to the enumeration of parametric polytopes. Two approaches are described and experimentally compared. Both can solve problems that were considered very difficult to solve analytically.
منابع مشابه
Computation and Manipulation of Enumerators of Integer Projections of Parametric Polytopes
Given a set of integer vectors defined by linear inequalities over a fixed number of variables, where some of the variables are considered as parameters, we consider two different ways of representing the number of elements in the set in terms of the parameters. The first is an explicit function which generalizes Ehrhart quasi-polynomials. The second is its corresponding generating function and...
متن کاملEnumeration of Integer Points in Projections of Unbounded Polyhedra
We extend the Barvinok–Woods algorithm for enumeration of integer points in projections of polytopes to unbounded polyhedra. For this, we obtain a new structural result on projections of semilinear subsets of the integer lattice. We extend the results to general formulas in Presburger Arithmetic. We also give an application to the k-Frobenius problem.
متن کاملEnumerating Integer Projections of Parametric Polytopes: A Direct Approach
Many compiler techniques depend on the ability to count the number of integer points that satisfy a given set of linear inequalities. Typically, a subset of the variables are identified as the parameters ~ p and the number of possible values for the other, “counted” variables ~y needs to be counted as a function of those parameters. If each variable is either a parameter or counted, then the pr...
متن کاملCounting with rational generating functions
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...
متن کاملPolynomial Coefficient Enumeration
Let f(x1, . . . , xk) be a polynomial over a field K. This paper considers such questions as the enumeration of the number of nonzero coefficients of f or of the number of coefficients equal to α ∈ K∗. For instance, if K = Fq then a matrix formula is obtained for the number of coefficients of fn that are equal to α ∈ Fq , as a function of n. Many additional results are obtained related to such ...
متن کامل